Fluent temporal logic for discrete-time event-based models
نویسندگان
چکیده
منابع مشابه
Linear-Time Temporal Logic Control of Discrete Event Systems
A Discrete Event System (DES) is a dynamic system that evolves in accordance with the instantaneous occurrence, at possibly unkown intervals, of physical events. Given a DES, its behavior (the sequence of displayed events) may not satisfy a set of logical performance objectives. The purpose of Supervisory Control is to restrict that behavior in order to achieve those objectives. Linear-Time Tem...
متن کاملFeature & Fluent revisited: from Event Calculus to Fluent Logic Programming
In this paper, we make use of a meta-logical representation based on the Kowalski and Sergot's Event Calculus in order to integrate the discrete uent logic (DFL) proposed in Features & Fluents by Erik Sandewall, into a logic programming (LP) setting. As result of this attempt we obtain an extended LP-based language that we call Fluent Logic Programming (FLP). Completeness result are shown with ...
متن کاملMerging Spatial and Temporal Logic for Discrete Event Control
This paper presents an adaptation of the logic CTL [5] for specifying properties of controllers and controlled discrete event systems. The class of systems is fully described in the textbook by Cassandras and Lafortune [4]. Our logic is an alternative to Pinchinat and Riedweg’s formalization [8] of quantified loop-μ-calculus, itself a response to the paper of Arnold et al. [1] on “games for syn...
متن کاملControl of Discrete Event Systems in Temporal Logic
Given the plant behavior and the desired behavior, both described in propositional linear temporal logic (PLTL), a causal, nonblocking and fair controller is to be synthesised that restricts the system’s closed loop behavior to a subset of the desired behavior. We present a syntactic procedure that gives the maximal such controller. We also give a semantic technique for the synthesis of this co...
متن کاملCounting Models of Linear-Time Temporal Logic
We investigate the model counting problem for safety specifications expressed in linear-time temporal logic (LTL). Model counting has previously been studied for propositional logic; in planning, for example, propositional model counting is used to compute the plan’s robustness in an incomplete domain. Counting the models of an LTL formula opens up new applications in verification and synthesis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGSOFT Software Engineering Notes
سال: 2005
ISSN: 0163-5948
DOI: 10.1145/1095430.1081719